Pointer chasing via triangular discrimination
نویسنده
چکیده
We prove an essentially sharp Ω̃(n/k) lower bound on the k-round distributional complexity of the k-step pointer chasing problem under the uniform distribution, when Bob speaks first. This is an improvement over Nisan and Wigderson’s Ω̃(n/k2) lower bound. A key part of the proof is using triangular discrimination instead of total variation distance; this idea may be useful elsewhere.
منابع مشابه
Multi-Chain Prefetching: Exploiting Natural Memory Parallelism in Pointer-Chasing Codes
This paper presents a novel pointer prefetching technique, called multi-chain prefetching. Multi-chain prefetching tolerates serialized memory latency commonly found in pointer chasing codes via aggressive prefetch scheduling. Unlike conventional prefetching techniques that hide memory latency underneath a single traversal loop or recursive function exclusively, multi-chain prefetching initiate...
متن کاملMulti-Chain Prefetching: Exploiting Memory Parallelism in Pointer-Chasing Codes
As the processor-memory performance gap continues to widen, application performance becomes increasingly limited by the memory system. Applications that employ linked data structures (LDSs) are particularly challenging from the standpoint of the memory system because of the memory serialization eeects associated with indirect memory addressing. Also known as the pointer chasing problem, such me...
متن کاملThe Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version
We consider the two-party quantum communication complexity of the bit version of the pointer chasing problem, originally studied by Klauck, Nayak, Ta-Shma and Zuckerman [KNTZ01]. We show that in any quantum protocol for this problem, the two players must exchange Ω( n k4 ) qubits. This improves the previous best bound of Ω( n 22 O(k) ) in [KNTZ01], and comes significantly closer to the best upp...
متن کاملPrivacy and Interaction in Quantum Communication Complexity and a Theorem about the Relative Entropy of Quantum States
We prove a theorem about the relative entropy of quantum states, which roughly states that if the relative entropy, S(ρ‖σ) ∆ = Tr ρ(log ρ− log σ), of two quantum states ρ and σ is at most c, then ρ/2 ‘sits inside’ σ. Using this ‘substate’ theorem, we give tight lower bounds for the privacy loss of bounded error quantum communication protocols for the index function problem. We also give tight l...
متن کاملMatroid intersection, pointer chasing, and Young's seminormal representation of Sn
We consider the number of queries needed to solve the matroid intersection problem, a question raised by Welsh (1976). Given two matroids of rank r on n elements, it is known that O(nr) independence queries suffice. However, no non-trivial lower bounds are known for this problem. We make the first progress on this question. We describe a family of instances of rank r = n/2 based on a pointer ch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 23 شماره
صفحات -
تاریخ انتشار 2016